Scene Visibility Complexity in Flatland
نویسندگان
چکیده
The objective of this paper is to study scene visibility complexity in flatland, expressed by scene visibility mutual information. To achieve this aim we consider several 2D scenes to try to understand the relationship of the complexity with the number, size, and relative position of the objects within the scene, the form of the enclosure and the number of patches. Particularly, we analyze the growth of complexity when the scene is close to a singularity that can occur in relation to the position of the objects or the form of the enclosure. Finally we present a simple and preliminary scene classification.
منابع مشابه
Visibility Complexity of Animation in Flatland
We address in this paper the problem of measuring the visibility complexity of scene animation in flatland. In our previous work we proposed a complexity measure which quantifies the information transfer in a scene. Here we introduce a new measure based also on information theory in order to capture the complexity of movement. Our approach measures the dissimilarity between successive frames of...
متن کاملVisibility Complexity of a Region in Flatland
The aim of this paper is to study the visibility complexity of different regions in a 2D scene. Based on mutual information, which we used in our previous work to define scene complexity, we propose two measures that quantify the complexity of a region from two different points of view. The knowledge of the complexity of a region can be useful to determine how difficult it is to recompute the v...
متن کاملCompressed Domain Scene Change Detection Based on Transform Units Distribution in High Efficiency Video Coding Standard
Scene change detection plays an important role in a number of video applications, including video indexing, searching, browsing, semantic features extraction, and, in general, pre-processing and post-processing operations. Several scene change detection methods have been proposed in different coding standards. Most of them use fixed thresholds for the similarity metrics to determine if there wa...
متن کاملAn Information Theory Framework for the Analysis of Scene Complexity
In this paper we present a new framework for the analysis of scene visibility and radiosity complexity. We introduce a number of complexity measures from information theory quantifying how difficult it is to compute with accuracy the visibility and radiosity in a scene. We define the continuous mutual information as a complexity measure of a scene, independent of whatever discretisation, and di...
متن کاملWeak Visibility of Two Objects in Planar Polygonal Scenes
Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a segment connecting two points of s and t without intersecting edges of the scene. In planar polygonal scenes, this problem is 3sum-hard and its time complexity is Ω(n) where n is the complexity of the scene. This problem can b...
متن کامل